package algorithm.linkedList;

/**
 * 定义双向链表节点
 */
public class DoubleListNode {
    public int val;
    public DoubleListNode pre;
    public DoubleListNode next;

    //三种构造方法
    public DoubleListNode(int val) {
        this.val = val;
    }

    public DoubleListNode(int val, DoubleListNode next) {
        this.val = val;
        this.next = next;
    }

    public DoubleListNode(int val, DoubleListNode next, DoubleListNode pre) {
        this.val = val;
        this.next = next;
        this.pre = pre;
    }
}
